منابع مشابه
AI Planning with Time and Resource Constraints
Planning deals with the problem of finding a partially ordered sequence of actions (plan) that transfers the world from some initial state to a desired state. Causal relations between actions play a critical role here. Introduction of explicit time and resources into planning is an important step towards modeling real-life problems. In this paper we propose a suboptimal domainindependent planni...
متن کاملSpace-Time Group Motion Planning
We present a novel approach for planning and directing heterogeneous groups of virtual agents based on techniques from linear programming. Our method efficiently identifies the most promising paths in both time and space and provides an optimal distribution of the groups’ members over these paths such that their average traveling time is minimized. The computed space-time plan is combined with ...
متن کاملOptimization with the time-dependent Navier-Stokes equations as constraints
In this paper, optimal distributed control of the time-dependent Navier-Stokes equations is considered. The control problem involves the minimization of a measure of the distance between the velocity field and a given target velocity field. A mixed numerical method involving a quasi-Newton algorithm, a novel calculation of the gradients and an inhomogeneous Navier-Stokes solver, to find the opt...
متن کاملPlanning for Mining Operations with Time and Resource Constraints
We study a daily mine planning problem where, given a set of blocks we wish to mine, our task is to generate a mining sequence for the excavators such that blending resource constraints are met at various stages of the sequence. Such time-oriented resource constraints are not traditionally handled well by automated planners. On the other hand, the remaining problem involves finding node-disjoin...
متن کاملTripRec: An Efficient Approach for Trip Planning with Time Constraints
The problem of trip planning with time constraints aims to find the optimal routes satisfying the maximum time requirement and possessing the highest attraction score. In this paper, a more efficient algorithm TripRec is proposed to solve this problem. Based on the principle of the Aprior algorithm for mining frequent item sets, our method constructs candidate attraction sets containing k attra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2013
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-013-9363-9